The worst parallel Hanoi graphs
نویسندگان
چکیده
منابع مشابه
The diameter of Hanoi graphs
Many questions regarding the Tower of Hanoi problem have been posed and answered during the years. Variants of the classical puzzle, such as allowing more than 3 pegs, and imposing limitations on the possible moves among the pegs, raised the analogous questions for those variants. One such question is: given a variant, and a certain number of disks, find a pair of disk arrangements such that th...
متن کاملSierpiński graphs as spanning subgraphs of Hanoi graphs
Hanoi graphs Hn p model the Tower of Hanoi game with p pegs and n discs. Sierpiński graphs Sn p arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that Sn p embeds as a spanning subgraph into Hn p if and only if p is odd or, trivially, if n = 1. MSC: 05C60
متن کاملThe Tower of Hanoi problem on Pathh graphs
The generalized Tower of Hanoi problem with h ≥ 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to another. In this paper we study the Pathh variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h−1)/2 possible bi...
متن کاملA Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries on Graphs
This talk presents the results in [2] about the worst-case optimal communication cost for parallel evaluation of conjunctive queries. Particularly, we describe a multi-round algorithm that computes any conjunctive query with load m/p ∗(Q) per server, in the case where all input relations are binary. Here, ρ∗(Q) denotes the fractional edge covering number of the query hypergraph, m is the maximu...
متن کاملAlgorithms and Bounds for Tower of Hanoi Problems on Graphs
The classic Tower of Hanoi puzzle was marketed by Edouard Lucas in 1883 under the name ”Tower of Hanoi” [31]. There, n disks are due to be moved from one peg to another, using an auxiliary peg while never placing a bigger disk above a smaller one. Its optimal solution is classic in Computer Science. In this thesis, we study a generalization of the original puzzle. The problem is generalized by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.09.012